Dynamic Radial View Based Culling for ontinuous Self-Collision Detection
نویسندگان
چکیده
The radial view-based culling (RVBC) method has been presented for continuous self-collision detection to efficiently cull away noncolliding regions. While this technique mainly relies on the segmented clusters of the reference pose and the associated fixed observer points, it has several drawbacks during the animation and the reduced cost of executing collision detection is limited. We thus present a modified framework to improve the culling efficiency of RVBC. At the preprocessing stage, we segment the closed deformable mesh according to not only the attached skeleton but also the triangle orientations, in order to minimize the collision checks of triangles in a cluster. At the runtime stage, we dynamically merge adjacent clusters and update the positions of observer points if the merged shape is nearly convex. This strategy minimizes the number of triangles in different clusters that required collision check. Our framework can be easily integrated with bounding volume hierarchies to boost the culling efficiency. Experimental results show that our framework achieves up to 5.2 times speedup over the original RVBC method and even more times over the recent techniques. CR Categories: I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism—Virtual Reality;
منابع مشابه
Efficient and Reliable Self-Collision Culling Using Unprojected Normal Cones
We present an efficient and accurate algorithm for self-collision detection in deformable models. Our approach can perform discrete and continuous collision queries on triangulated meshes. We present a simple and linear time algorithm to perform the normal cone test using the unprojected 3D vertices, which reduces to a sequence point-plane classification tests. Moreover, we present a hierarchic...
متن کاملPSCC: Parallel Self-Collision Culling with Spatial Hashing on GPUs
We present a GPU-based self-collision culling method (PSCC) based on a combination of normal cone culling and spatial hashing techniques. We first describe a normal cone test front (NCTF) based parallel algorithm that maps well to GPU architectures. We use sprouting and shrinking operators to maintain compact NCTFs. Moreover, we use the NCTF nodes to efficient build an enhanced spatial hashing ...
متن کاملBack-face culling applied to collision detection of polyhedra
Back-face culling is a preprocessing technique used in computer graphics to speed up the rendering of polyhedra. In this paper we show how this technique can. be modified to reduce unnecessary checking of boundary elements in collision detection for a phYBica.l-based simulations and animation systems. At each time stepl we determine a priori which faces cannot be part of the contact between two...
متن کاملHybrid Collision Culling by Bounding Volumes Manipulation in Massive Rigid Body Simulation
Collision detection is an important aspect in many real-time simulation environments. Due to its nature of high Computation involved, collision detection can contribute to the bottleneck on the system involving large number of interacting objects. This paper focuses on finding options to efficiently cull away object pairs that are not likely to collide in large-scale dynamic rigid-body simulati...
متن کاملHierarchical back-face culling for collision detection
A few years ago, Vanecek[16] suggested to apply a variant of back-face culling to speed-up collision detection between polyhedral objects. However, Vanecek’s method is linear in the number of faces in the object, which is unpractical for large models. This paper suggests to add some geometrical information to hierarchies of bounding volumes, typically used in collision detection, and perform co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013